induced subgraph
英
美
网络 诱导子图; 导出子图; 生成子图; 子图
双语例句
- G is said to be bipartite matching extendable if every matching M whose induced subgraph is a bipartite matching extends to a perfect matching.
称图G是偶匹配可扩的，是指G的每一个偶匹配都可以扩充成为G的一个完美匹配。 - It is shown that let G is a connected, N 2-locally connected K 1,4-restricted graph with δ≥ 6, which does not contain an induced subgraph H isomorphic to one of G 1, G 2 and G 3, then G is hamiltonian.
证明如下结论：设G是连通、N2-局部连通、δ≥6的K1,4-受限图，如果G中不含有同构于G1，G2或G3的导出子图H，则G含哈密顿圈。 - The Connectivity of Induced Subgraph by all Contractible Edges in K-Connected Graph
k连通图可缩边导出子图的连通性 - On the other hand, We obtain the statement that the quasi-independence graph of a decomposed component is the same as Itself induced subgraph.
另外，作者证明了分解分量的拟独立图等于它的导出图这一有用的结论。 - We deny the confirmation with the identity of independence graph and induced subgraph of a decomposed component, which was discussed by [ 1].
通过反例否定了[1]中关于分解分量的独立图等于导出图的结论。 - A subset S of E ( G) is called an edge covering of G if the subgraph induced by S is a spanning subgraph of G.
SE（G）称为G的一个边覆盖，如果由S导出的子图是G的一个生成子图。 - The induced spanning subgraph was employed in studying the property of the graph of decomposable tensor.
应用诱导生成子图的方法，研究了可合张量的图论性质。 - On topologic relations between the charge density distribution of nondegenerate orbits and molecular fragments of the induced subgraph in a conjugate molecule
共轭分子非简并轨道电荷密度分布与导图分子片的拓扑关系 - Induced subgraph and Hamiltonian property of graph
生成子图与图的哈密顿性质